package com.jm.offer.easy;

import com.jm.offer.TreeNode;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

/**
 * @Description https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/
 * @date 2022/4/20 8:20
 */
public class _32_II从上到下打印二叉树 {

    public static void main(String[] args) {
        TreeNode root = new TreeNode(3);
        TreeNode l = new TreeNode(9);
        TreeNode r = new TreeNode(20);
        TreeNode r_l = new TreeNode(15);
        TreeNode r_r = new TreeNode(7);

        root.left = l;
        root.right = r;
        r.left = r_l;
        r.right = r_r;
        List<List<Integer>> list = levelOrder(root);
        for (List<Integer> integers : list) {
            for (Integer integer : integers) {
                System.out.println(integer);
            }
        }
    }

    public static List<List<Integer>> levelOrder(TreeNode root) {
        // TODO: 2022/4/20
        return null;
    }

}
